Primal-dual first-order methods with O(1/) iteration-complexity for cone programming ∗ Guanghui Lan †

Source URL: www.ise.ufl.edu

Safe Nondeterminism in a Deterministic-by-Default Parallel Language Robert L. Bocchino Jr.1 Stephen Heumann2 Nima Honarmand2 Sarita V. Adve2

Source URL: www.adamwelc.org

• Software engineering
• Computing
• Computer programming
• Concurrency control
• Transaction processing
• Complexity classes
• Java
• Functional languages
• Deterministic Parallel Java
• Determinism
• Deterministic algorithm
• Linearizability

PDF Document

Source URL: ceng.usc.edu

• Combinatorial optimization
• Hungarian algorithm
• Matching
• Time complexity
• Dynamic programming

BRICS Basic Research in Computer Science BRICS RSDamian & Danvy: CPS Transformation of Flow Information, Part II: Administrative Reductions CPS Transformation of Flow Information

Source URL: www.brics.dk

• Computational complexity theory
• Continuation-passing style
• Continuations
• Functional programming
• Lambda calculus
• Static single assignment form
• Reduction
• Theoretical computer science
• Applied mathematics
• Software engineering

Performance analysis of OFDM modulation on indoor broadband PLC channels

Source URL: jwcn.eurasipjournals.com

• Computational complexity theory
• Mathematics
• Applied mathematics
• Ordinary differential equations
• Mathematical analysis
• Optimal control
• Mathematical optimization
• Operations research
• Convex optimization
• Linear programming

Constraints Ian Miguel () Ian Gent, Andy Grayland, Chris Jefferson, Tom Kelsey, Lars Kotthoff, Steve Linton, Neil Moore, Peter Nightingale, Andrea Rendl

Source URL: www-circa.mcs.st-and.ac.uk

• Computing
• Constraint satisfaction
• Constraint
• Constraint logic programming
• Complexity of constraint satisfaction
• Constraint programming
• Software engineering
• Computer programming

Sage Reference Manual: Numerical Optimization Release 6.7 The Sage Development Team

Source URL: doc.sagemath.org

• Operations research
• Dynamic programming
• Cryptography
• Combinatorial optimization
• Knapsack problem
• Subset sum problem
• Sequence
• Exponentiation
• Linear programming
• Mathematics
• Theoretical computer science
• Computational complexity theory

On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems Carsten Lutz1 and Frank Wolter2 1 2

Source URL: www.informatik.uni-bremen.de

• Finite model theory
• Descriptive complexity
• Computational complexity theory
• FO
• Constraint programming
• Constraint satisfaction problem
• Conjunctive query
• SO
• HO
• Theoretical computer science
• Applied mathematics
• Complexity classes

On Understanding Software Agility—A Social Complexity Point Of View E:CO Issue Vol. 13 NosppApplied On Understanding Software Agility—

Source URL: www.metaprog.com

• Agile software development
• Formal methods
• Systems
• Management
• Cynefin
• Extreme programming
• Wicked problem
• Software development process
• Requirement
• Software development
• Software
• Software project management

Theoretical Computer Science Master of Computer Science Study branches I1 Theoretical Computer Science I3 Mathematical Linguistics

Source URL: www.mff.cuni.cz

• Theoretical computer science
• Combinatorics
• Algorithm
• Discrete mathematics
• Computational complexity theory
• Mathematical optimization
• Linear programming
• Computer science
• Graph theory
• Operations research
• Applied mathematics
• Mathematics